On universal graphs without instances of CH

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On universal graphs without cliques or without large bipartite graphs

For every uncountable cardinal A, suitable negations of the Generalized Continuum Hypothesis imply: (a) There is no universal Ka 3. The instance Kuf^>t for A = Ni was settled in [KP] from a strengthening of CH.

متن کامل

Universal Graphs without Large Cliques

The theory of universal graphs originated from the observation of R. Rado [4,5] that a universal countable graph X exists, i.e., X is countable and isomorphically embeds every countable graph. He also showed that under GCH, there is a universal graph in every infinite cardinal. Since then, several results have been proved about the existence of universal elements in different classes of graphs....

متن کامل

Universal Graphs without Large Cliques

The theory of universal graphs originated from the observation of R. Rado [4,5] that a universal countable graph X exists, i.e., X is countable and isomorphically embeds every countable graph. He also showed that under GCH, there is a universal graph in every infinite cardinal. Since then, several results have been proved about the existence of universal elements in different classes of graphs....

متن کامل

Minor-universal planar graphs without accumulation points

We show that the countably infinite union of infinite grids, H say, is minor-universal in the class of all graphs that can be drawn in the plane without vertex accumulation points, i.e. that H contains every such graph as a minor. Furthermore, we characterize the graphs that occur as minors of the infinite grid by a natural topological condition on their embeddings.

متن کامل

A ug 1 99 3 Universal graphs without large cliques

The theory of universal graphs originated from the observation of R. Rado [4,5] that a universal countable graph X exists, i.e., X is countable and isomorphically embeds every countable graph. He also showed that under GCH, there is a universal graph in every infinite cardinal. Since then, several results have been proved about the existence of universal elements in different classes of graphs....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 1984

ISSN: 0168-0072

DOI: 10.1016/0168-0072(84)90042-3